Elevator System with Destination Control and Fpga Implementation of Dispatching Algorithms

نویسندگان

  • Daniel M. Muñoz
  • Carlos H. Llanos
چکیده

Elevator systems for vertical transport of passengers are implemented in modern high-rise buildings. Conventional elevator systems use up and down hall-call buttons for calling an elevator service, a group of local control systems (LCS), one per elevator, and an Elevator Group Control System (EGCS) which selects the most suitable elevator for attending a hall-call. The performance of an elevator system is measured by means of several parameters such as the power consumption, average waiting time of passengers, among others. Conventional elevator systems have critical problems, such as, uncertainty about destination calls and number of passengers waiting for an elevator, as well as, a high computational cost. Nowadays, Field Programmable Gate Arrays (FPGAs) devices have been widely used in automation systems, given that reconfigurable architectures can be effectively applied to the realization of complex systems, with good performance and flexibility, keeping the requirements of every process or products in a customized way. In order to improve the performance of the elevator system the Destination Control System (DCS) was introduced in last years. The DCS uses destination keypads in the halls allowing the controller to know the destination floor and the exact number of passengers waiting for a car. This paper proposes a distributed approach for an elevator system, which comprises a network of Destination Control Systems (one per floor), an EGCS based on Fuzzy Logic (FEGCS) running on a CPU and an RS-485 network for connecting several Local Control Systems (LCS), developed on FPGAs, each one of them implementing several dispatching algorithms. The proposed architecture take advantage of the efficient grouping of passengers provided by DCS and the flexibility provided by the FPGAs, allowing to implement, simultaneously, different scheduling strategies according to the traffic situations in the building.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effect of Randomization on Constraint Based Estimation of Elevator Trip Origin-Destination Matrices

We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem, and study different deterministic and randomized algorithms to solve the problem. An elevator trip consists of successive stops in one direction of travel with passengers inside the elevator. It can be defined as a directed network, where the nodes correspond to the stops on the t...

متن کامل

Design and implementation of an adaptive dispatching controller for elevator systems during uppeak traffic

We design a dispatching controller for elevator systems during uppeak passenger traffic with the ability to adapt to changing operating conditions. The design of this controller is motivated by our previous paper where we proved that for a queuing model of the uppeak dispatching problem a threshold policy is optimal (in the sense of minimizing the average passenger waiting time) with threshold ...

متن کامل

Optimal Car Dispatching For Elevator Groups Using Genetic Algorithms

The car dispatching problem in an elevator group consists of assigning cars to the hall calls at the same time that car call are served. The problem needs to coordinate the movements of individual cars with the objective of operating efficiently the whole group. In this paper, we propose an elevator group control system based on a genetic algorithm which makes use of a novel fitness function to...

متن کامل

The Elevator Trip Origin-Destination Matrix Estimation Problem

We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem, and propose different approaches to solve the problem. An elevator trip consists of successive stops in one direction of travel with passengers inside the elevator. It can be defined as a directed network, where the nodes correspond to the stops on the trip, and the arcs to the po...

متن کامل

Estimation of Elevator Passenger Traffic Based on the Most Likely Elevator Trip Origin-Destination Matrices

We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem using a lexicographic bi-criteria optimization method where least squares minimization is applied to the measured counts and the minimum information or the maximum entropy approach to the whole matrix. An elevator trip consists of successive stops in one direction of travel with pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009